What topology tells us about diagnosability in partial order semantics
نویسنده
چکیده
From a partial observation of the behaviour of a labeled Discrete Event System, fault diagnosis strives to determine whether or not a given “invisible” fault event has occurred. The diagnosability problem can be stated as follows: does the labeling allow for an outside observer to determine the occurrence of the fault, no later than a bounded number of events after that unobservable occurrence ? When this problem is investigated in the context of concurrent systems, partial order semantics adds to the difficulty of the problem, but also provides a richer and more complex picture of observation and diagnosis. In particular, it is crucial to clarify the intuitive notion of “time after fault occurrence”. To this end, we will use a unifying metric framework for event structures, providing a general topological description of diagnosability in both sequential and nonsequential semantics for Petri nets.
منابع مشابه
Functorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملPhysics from the lattice : glueballs in QCD ; topology ; SU ( N ) for all
1 1 Introduction In these lectures I will show, through three examples, how current lattice calculations are able to tell us interesting things about the continuum physics of non-Abelian gauge theories. My first topic concerns the glueball spectrum. The physics question here is: where, in the experimentally determined hadron spectrum, are the glueballs hiding? I will first summarise what lattic...
متن کاملSituation Calculus as Answer Set Programming
We show how the situation calculus can be reformulated in terms of the first-order stable model semantics. A further transformation into answer set programs allows us to use an answer set solver to perform propositional reasoning about the situation calculus. We also provide an answer set programming style encoding method for Reiter’s basic action theories, which tells us how the solution to th...
متن کاملPartial Order and Contextual Net
We present two concurrent semantics (i.e. semantics where concurrency is ex-plicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extension of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism infor...
متن کاملWhat can fruit flies teach us about karate?
Understanding the logic behind how a fruit fly's brain tells it to groom its body parts in a stereotyped order might help us understand other behaviours that also involve a series of actions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010